1

Maximizing spanning trees in almost complete graphs

Year:
1997
Language:
english
File:
PDF, 94 KB
english, 1997
2

The ally-reconstruction number of a tree with five or more vertices is three

Year:
1990
Language:
english
File:
PDF, 788 KB
english, 1990
3

Uniformly-most reliable networks do not always exist

Year:
1991
Language:
english
File:
PDF, 135 KB
english, 1991
5

The obstructions for toroidal graphs with no ’s

Year:
2009
Language:
english
File:
PDF, 816 KB
english, 2009
6

Simpler Projective Plane Embedding

Year:
2000
Language:
english
File:
PDF, 184 KB
english, 2000
7

Maximizing spanning trees in almost complete graphs

Year:
1997
Language:
english
File:
PDF, 94 KB
english, 1997
8

Generating simple convex Venn diagrams

Year:
2012
Language:
english
File:
PDF, 1.83 MB
english, 2012
9

Recognizing connectedness from vertex-deleted subgraphs

Year:
2011
Language:
english
File:
PDF, 248 KB
english, 2011
10

Two Algorithms for Unranking Arborescences

Year:
1996
Language:
english
File:
PDF, 147 KB
english, 1996
13

Counting k-component forests of a graph

Year:
1992
Language:
english
File:
PDF, 331 KB
english, 1992
14

Reliability polynomials can cross twice

Year:
1993
Language:
english
File:
PDF, 285 KB
english, 1993
15

Computational determination of and cages

Year:
2011
Language:
english
File:
PDF, 130 KB
english, 2011
16

Small latin squares, quasigroups, and loops

Year:
2007
Language:
english
File:
PDF, 169 KB
english, 2007
17

Ranking and unranking permutations in linear time

Year:
2001
Language:
english
File:
PDF, 49 KB
english, 2001
19

Ovals and hyperovals in nets

Year:
2005
Language:
english
File:
PDF, 371 KB
english, 2005
20

The degree sequence is reconstructible from n − 1 cards

Year:
1992
Language:
english
File:
PDF, 607 KB
english, 1992
24

Errors in graph embedding algorithms

Year:
2011
Language:
english
File:
PDF, 219 KB
english, 2011
25

Non-IPR fullerenes with properly closed shells

Year:
2010
Language:
english
File:
PDF, 708 KB
english, 2010